n Solving Fuzzy Constraint Satisfaction Problems with Genetic Algorithms
نویسنده
چکیده
An attempt to solve fuzzy constraint satisfaction problems (FCSPs) with the use of genetic algorithms (GAS) is presented in the paper. A fuzzy relation that represents the degrees of Satisfaction of fuzzy constraints in a given FCSP is considered as an objective jimction of the respective unconstrained optimization problem. A solution of a FCSP such that all constraints are satisfied to the maximal degree is searched for with a GA using the objective function to evaluate the prospective solutions with respect to fuzzy constraint satisfaction. The presented approach is illustrated with an exumple of a FCSP taking into account different levels of fuzzy granulation influencing GA’s pegormance.
منابع مشابه
Structure and Properties of Leximin FCSP and its Influence on Optimisation Algorithms
In this paper we investigate why solving leximin fuzzy constraint satisfaction problems (FCSP) with non-enumerative algorithms, such as hill-climbing, simulated annealing and genetic algorithms, provide disappointing results. Specifically, we analyse the structure and properties of the leximin FCSPs and its influence on the search strategy of non-enumerative algorithms.
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملGA-easy and GA-hard Constraint Satisfaction Problems
In this paper we discuss the possibilities of applying genetic algorithms (GA) for solving constraint satisfaction problems (CSP). We point out how the greediness of deterministic classical CSP solving techniques can be counterbalanced by the random mechanisms of GAs. We tested our ideas by running experiments on four diierent CSPs: N-queens, graph 3-colouring, the traac lights and the Zebra pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004